Syntactic monoid

In mathematics and computer science, the syntactic monoid M(L) of a formal language L is the smallest monoid that recognizes the language L.

Contents

Syntactic quotient

Given S\subset M of a monoid M, one may define sets that consist of formal left or right inverses of elements in S. These are called quotients, and one may define right or left quotients, depending on which side one is concatenating. Thus, the right quotient of S by an element m\in M is the set

S \ / \ m=\{u\in M \;\vert\; um\in S \}.

Similarly, the left quotient is

m \setminus S=\{u\in M \;\vert\; mu\in S \}.

Syntactic equivalence

The syntactic quotient induces an equivalence relation on M, called the syntactic relation, or syntactic equivalence or syntactic congruence (induced by S). The right syntactic equivalence is the equivalence relation

\sim_S \;= \{(s,t)\in M\times M \,\vert\; S \ / \ s = S \ / \ t \}.

Similarly, the left syntactic relation is

\,_S\sim \;= \{(s,t)\in M\times M \,\vert\; s\setminus S = t \setminus S \}.

A double-sided congruence may be defined as

u \sim_S v \Leftrightarrow \forall x, y\in M (xuy \in S \Leftrightarrow xvy \in S).

Syntactic monoid

The syntactic quotient is compatible with concatenation in the monoid, in that one has

(M \ / \ s) \ / \ t = M \ / \ (ts)

for all s,t\in M (and similarly for the left quotient). Thus, the syntactic quotient is a monoid morphism, and induces a quotient monoid

M(S)= M \ / \ \sim_S.

It can be shown that the syntactic monoid of S is the smallest monoid that recognizes S ; that is, M(S) recognizes S, and for every monoid N recognizing S, M(S) is a quotient of a submonoid of N. The syntactic monoid of S is also the transition monoid of the minimal automaton of S.

Equivalently, a language L is recognizable if and only if the family of quotients

\{m \setminus L \,\vert\; m\in M\}

is finite. The proof showing equivalence is quite easy. Assume that a string x is recognizable by a deterministic finite automaton, with the final state of the machine being f. If y is another string recognized by the machine, also terminating in the same final state f, then clearly one has x \setminus L\,\sim y \setminus L. Thus, the number of elements in \{m \setminus L \,\vert\; m\in M\} is just exactly equal to the number of final states of the automaton. Assume the converse: that the number of elements in \{m \setminus L \,\vert\; m\in M\} is finite. One can then construct an automaton where so that Q=\{m \setminus L \,\vert\; m\in M\} is the set of states, F=\{m \setminus L \,\vert\; m\in L\} is the set of final states, the language L is the initial state, and the transition function is given by y\setminus(x \setminus L) =(xy) \setminus L. Clearly, this automaton recognizes L. Thus, a language L is recognizable if and only if the set \{m \setminus L \,\vert\; m\in M\} is finite.

Given a regular expression E representing S, it is easy to compute the syntactic monoid of S.

Examples

References